Canonical Inference for Implicational Systems⋆ Maria Paola Bonacina⋆⋆1 and Nachum Dershowitz⋆ ⋆ ⋆2 1 2

Source URL: profs.sci.univr.it

• Theoretical computer science
• Logic in computer science
• Conditionals
• Rewriting
• Propositional calculus
• Necessity and sufficiency
• Mathematical proof
• Implicational propositional calculus
• Mathematics
• Logic
• Mathematical logic

Canonical Ground Horn Theories Maria Paola Bonacina1⋆ and Nachum Dershowitz2 1 2

Source URL: profs.sci.univr.it

• Propositional calculus
• Boolean algebra
• Logic in computer science
• Semantics
• Mathematical proof
• Horn clause
• Negation
• Unification
• Interpretation
• Logic
• Mathematical logic
• Mathematics

Cut Elimination in Deduction Modulo by Abstract Completion Guillaume Burel1 and Claude Kirchner2 1 3

Source URL: www.ensiie.fr

• Natural deduction
• Sequent calculus
• Cut-elimination theorem
• Sequent
• Rule of inference
• First-order logic
• Mathematical proof
• KeY
• Negation
• Logic
• Mathematical logic
• Proof theory

Soundness of embeddings in the λΠ-calculus modulo rewriting Ali Assaf Deducteam, Inria Paris-Rocquencourt École Polytechnique

Source URL: who.rocq.inria.fr

• Logic
• Logic in computer science
• Dependently typed programming
• Lambda calculus
• Proof theory
• Curry–Howard correspondence
• First-order logic
• Logical framework
• System F
• Mathematical logic
• Theoretical computer science
• Type theory

BRICS Basic Research in Computer Science BRICS RSAndersen et al.: A Compositional Proof System for the Modal µ-Calculus A Compositional Proof System for the

Source URL: www.brics.dk

Proof-Carrying Code in a Session-Typed Process Calculus Frank Pfenning1 , Luis Caires2 , and Bernardo Toninho1,2 1 2

Source URL: ctp.di.fct.unl.pt

2009 Paper 6 Question 8 Logic and Proof (a) Briefly indicate the differences between the tableau calculus and the sequent calculus. [2 marks]

Source URL: www.cl.cam.ac.uk

1997 Paper 5 Question 10 Logic and Proof Using binary predicate symbols EQ (=) and LT (<) and binary function symbols SUM (+) and PROD (×), write down predicate calculus formulae that formalise the following statements

Source URL: www.cl.cam.ac.uk

Proof Search Specifications of Bisimulation and Modal Logics for the π-calculus Alwen Tiu Logic and Computation Group College of Engineering and Computer Science The Australian National University

Source URL: www.lix.polytechnique.fr

Embedding logics in Dedukti 2014 edition Ali Assaf 2nd KWARC-Deducteam workshop May 26, 2014

Source URL: who.rocq.inria.fr

• Type theory
• Lambda calculus
• Formal methods
• Logic in computer science
• Coq
• Pure type system
• HOL
• Correctness
• Automated proof checking
• Theoretical computer science
• Applied mathematics
• Programming language theory